Close

1. Identity statement
Reference TypeJournal Article
Siteplutao.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
IdentifierJ8LNKAN8RW/37DDJH5
Repositorydpi.inpe.br/plutao@80/2010/04.28.17.11
Last Update2010:05.19.17.28.33 (UTC) administrator
Metadata Repositorydpi.inpe.br/plutao@80/2010/04.28.17.11.07
Metadata Last Update2018:06.05.00.13.02 (UTC) administrator
Secondary KeyINPE--PRE/
ISSN0104-530X
Labellattes: 6187221670775160 1 YanasseCerq:2009:HeBaGe
Citation KeyYanasseRodrSenn:2009:AlEnBa
TitleUm algoritmo enumerativo baseado em ordenamento parcial para resolução do problema de minimização de trocas de ferramentas
Year2009
Access Date2024, May 28
Secondary TypePRE PN
Number of Files1
Size329 KiB
2. Context
Author1 Yanasse, Horacio Hideki
2 Rodrigues, R. C. M
3 Senne, E. L. F
Resume Identifier1 8JMKD3MGP5W/3C9JHCP
Group1 LAC-CTE-INPE-MCT-BR
Affiliation1 Instituto Nacional de Pesquisas Espaciais (INPE)
Author e-Mail Address1 horacio@lac.inpe.br
e-Mail Addresshoracio@lac.inpe.br
JournalGestão & Produção
Volume16
Pages370-381
History (UTC)2010-04-28 17:21:05 :: marciana -> administrator ::
2010-05-12 02:07:27 :: administrator -> marciana ::
2010-05-19 17:29:34 :: marciana -> administrator :: 2009
2018-06-05 00:13:02 :: administrator -> marciana :: 2009
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
KeywordsProblema de minimização de trocas de ferramenta. Ordenamento parcial. Limitante inferior
Minimization of tool switches problem. Partial ordering. Lower bound
AbstractNo problema de minimização de troca de ferramentas procura-se por uma sequência para processar um conjunto de tarefas de modo que o número requerido de trocas de ferramentas seja o menor possível. Neste trabalho propõe-se um algoritmo para resolver este problema baseado em um ordenamento parcial das tarefas. Uma sequência ótima é obtida expandindo-se as sequências parciais enumeradas. Testes computacionais são apresentados. ABSTRACT: In the minimization of tool switches problem we seek to determine a sequence to process a set of jobs so that the number of tool switches required is minimized. In this work we propose an algorithm to solve this problem based on partial ordered sequences of jobs. An optimal sequence is obtained expanding the partial sequences enumerated. Computational test results are presented.
AreaCOMP
Arrangementurlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > Um algoritmo enumerativo...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://plutao.sid.inpe.br/ibi/J8LNKAN8RW/37DDJH5
zipped data URLhttp://plutao.sid.inpe.br/zip/J8LNKAN8RW/37DDJH5
Languagept
Target Filev16n3a05.pdf
User Groupadministrator
lattes
marciana
Visibilityshown
Copy HolderSID/SCD
Archiving Policyallowpublisher allowfinaldraft
5. Allied materials
Next Higher Units8JMKD3MGPCW/3ESGTTP
DisseminationPORTALCAPES; SCIELO.
Host Collectiondpi.inpe.br/plutao@80/2008/08.19.15.01
6. Notes
Empty Fieldsalternatejournal archivist callnumber copyright creatorhistory descriptionlevel documentstage doi format isbn lineage mark mirrorrepository month nextedition notes number orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url versiontype
7. Description control
e-Mail (login)marciana
update 


Close